Self-stabilizing byzantine asynchronous unison
نویسندگان
چکیده
منابع مشابه
Self-stabilizing Byzantine Asynchronous Unison,
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies. Our algorithm h...
متن کاملStabilizing Unison
The guard of an action in program P.i is a Boolean expression over the x variables and the local variables of P.i. The assignment statement of an action in P.i updates variable x.i and the local variables of P. i. A state of this system is defined by a value for every x.i and a value for every local variable in each program. An action whose guard is true at some state is said to be enabled at t...
متن کاملSelf-Stabilizing Byzantine Token Circulation
There is an abundance of writing about Token Circulation (or leader election). Much of the work is dedicated to self-stabilizing Token Circulation, ever since the publishing of Dijkstra’s seminal paper. Few of the papers focus on the Byzantine fault model and, to the best of our knowledge, there is no self-stabilizing Token Circulation algorithm that tolerates Byzantine faults. In this paper, w...
متن کاملSelf-Stabilizing Byzantine Pulse Synchronization
We present a distributed pulse synchronization algorithm, which targets at invoking regular and tightly synchronized pulses. Designing algorithms that self-stabilize while at the same time tolerating an eventual fraction of permanent Byzantine failures present a special challenge due to the ambition of malicious nodes to hamper stabilization if the systems tries to recover from a corrupted stat...
متن کاملUnison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks
How to pass from local to global scales in anonymous networks? In such networks, how to organize a self-stabilizing propagation of information with feedback? From Angluin’s results, the deterministic leader election is impossible in general anonymous networks. Thus, it is impossible to build a rooted spanning tree. In this paper we show how to use Unison to design a selfstabilizing barrier sync...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2012
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2012.04.001